例句與造句

1. Non-asymptotic bounds are provided by methods of approximation theory.
2. Szemer閐i's theorem is equivalent to the asymptotic bound
3. I am more interested in non-asymptotic bounds.
4. Non-asymptotic bounds have also been proved.
5. Another line of research in high dimensions is trying to find asymptotic bounds for the density of the densest packings.
6. It's difficult to find asymptotic bound in a sentence. 用asymptotic bound造句挺難的
7. *PM : asymptotic bounds for factorial, id = 7910 new !-- WP guess : asymptotic bounds for factorial-- Status:
8. *PM : asymptotic bounds for factorial, id = 7910 new !-- WP guess : asymptotic bounds for factorial-- Status:
9. Katok's entropy inequality was recently exploited to obtain a tight asymptotic bound for the systolic ratio of surfaces of large genus, see systoles of surfaces.
10. While having better asymptotic bounds than other priority queue structures, they are, in the words of Brodal himself, " quite complicated " and " [ not ] applicable in practice ."
11. A reference of the works done on " the study of random abstract simplicial complexes generated from stochastic processes and non-asymptotic bounds on the convergence or consistency of topological summaries as the number of points increase " can be found in K . Turner et al.
12. More precisely, R閚yi and Tur醤 showed that the best possible uniform asymptotic bound on the error in the approximation to a Gaussian is O \ left ( \ frac { 1 } { \ sqrt { \ log ( \ log ( n ) ) } } \ right ).
13. A weaker form of the separator theorem with O (  " " n " log " n " ) vertices in the separator instead of O (  " " n " ) was originally proven by, and the form with the tight asymptotic bound on the separator size was first proven by.
14. It was discovered recently ( see paper by Katz and Sabourau below ) that the volume entropy " h ", together with A . Katok's optimal inequality for " h ", is the " right " intermediary in a transparent proof of M . Gromov's asymptotic bound for the systolic ratio of surfaces of large genus.
15. Some proofs of the security are in given theoretical models such as the random oracle model, where real cryptographic hash functions are represented by an idealization . " Exact security " or " concrete security " is the name given to provable security reductions where one quantifies security by computing precise bounds on computational effort, rather than an asymptotic bound which is guaranteed to hold for " sufficiently large " values of the security parameter.
16. These results may also be interpreted as giving asymptotic bounds on the Ramsey numbers R ( 3, " t " ) of the form \ Theta ( \ tfrac { t ^ 2 } { \ log t } ) : if the edges of a complete graph on \ Omega ( \ tfrac { t ^ 2 } { \ log t } ) vertices are colored red and blue, then either the red graph contains a triangle or, if it is triangle-free, then it must have an independent set of size " t " corresponding to a clique of the same size in the blue graph.